Decreasing Error Rate of k-NN for Data classification using Double weighted function
نویسنده
چکیده
For prediction of future class label or Variable value, there are two techniques respectively – Classification and Regression [2,5]. Data classification is a process between query point and training dataset to categorize query point. Using pre-labeled training dataset and classification algorithm, class label is assigned to new query point. Pre-labeled training dataset is taken from historical database of real world [6]. There are many data classification techniques exist like Decision Tree, Neural Network and Support Vector Machine etc. Among all, k-NN algorithm is simple and effective supervised algorithm for large dataset [7]. k-NN algorithm use all existing training datasets every time to classify new query point[3]. So it required more space to store all training dataset but give effective result. Here, k-NN algorithm is explained in details below. Falguni N. Patel Assistant Professor, Information Technology Department, Sardar Vallabhbhai Patel Institute of Technology, Vasad, DistAnand, Gujarat. falgunimanish19 @gmail.com
منابع مشابه
Neural Network Based Recognition System Integrating Feature Extraction and Classification for English Handwritten
Handwriting recognition has been one of the active and challenging research areas in the field of image processing and pattern recognition. It has numerous applications that includes, reading aid for blind, bank cheques and conversion of any hand written document into structural text form. Neural Network (NN) with its inherent learning ability offers promising solutions for handwritten characte...
متن کاملIdeal bootstrap estimation of expected prediction error for k-nearest neighbor classifiers: Applications for classification and error assessment
Euclidean distance -nearest neighbor ( -NN) classifiers are simple nonparametric classification rules. 5 5 Bootstrap methods, widely used for estimating the expected prediction error of classification rules, are motivated by the objective of calculating the ideal bootstrap estimate of expected prediction error. In practice, bootstrap methods use Monte Carlo resampling to estimate the ideal boot...
متن کاملمقایسه عملکرد مدل کاکس و روش K ـ نزدیکترین همسایگی در تخمین بقای بیماران پیوند کلیه
Introduction & Objective: Cox model is a common method to estimate survival and validity of the results is dependent on the proportional hazards assumption. K- Nearest neighbor is a nonparametric method for survival probability in heterogeneous communities. The purpose of this study was to compare the performance of k- nearest neighbor method (K-NN) with Cox model. Materials & Methods: This ...
متن کاملModification of the Fast Global K-means Using a Fuzzy Relation with Application in Microarray Data Analysis
Recognizing genes with distinctive expression levels can help in prevention, diagnosis and treatment of the diseases at the genomic level. In this paper, fast Global k-means (fast GKM) is developed for clustering the gene expression datasets. Fast GKM is a significant improvement of the k-means clustering method. It is an incremental clustering method which starts with one cluster. Iteratively ...
متن کاملOptimized Seizure Detection Algorithm: A Fast Approach for Onset of Epileptic in EEG Signals Using GT Discriminant Analysis and K-NN Classifier
Background: Epilepsy is a severe disorder of the central nervous system that predisposes the person to recurrent seizures. Fifty million people worldwide suffer from epilepsy; after Alzheimer’s and stroke, it is the third widespread nervous disorder.Objective: In this paper, an algorithm to detect the onset of epileptic seizures based on the analysis of brain electrical signals (EEG) has b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015